Efficient Proximity Search for -D Cuboids
نویسندگان
چکیده
In this paper, we give the definition for the voronoi diagram and its dual graph – Delaunay triangulation for 3D cuboids. We prove properties of the 3D Delaunay triangulation, and provide algorithms to construct and update the Delaunay triangulation. The Delaunay triangulation data structure is used to perform proximity searches for both static and kinetic cases. We describe experimental results that show how the Delaunay triangulation is used on a mobile robot to model, understand and reason about the spatial information of the environment.
منابع مشابه
Optimal Placement and Sizing of TCSC & SVC for Improvement Power System Operation using Crow Search Algorithm
Abstract: The need for more efficient power systems has prompted the use of a new technologies includes Flexible AC transmission system (FACTS) devices. FACTS devices provides new opportunity for controlling the line power flow and minimizing losses while maintaining the bus voltages within a permissible limit. In this thesis a new method is proposed for optimal placement and sizing of Thyristo...
متن کاملNew Approach of Computing Data Cubes in Data Warehousing
The paper is dealing with data cubes built for data warehouse for OLAP purposes. OLAP (Online Analytical Processing) system offers multidimensional data analysis in which large volume of historically collected data is computed. To decrease the query time and to provide various options to the analysts, a data model was designed to organize data perfectly in a multidimensional data model. In OLAP...
متن کاملOn Search for all d-MCs in a Network Flow
A number of problems in several areas such as power transmission and distribution, communication and transportation can be formulated as a stochastic-flow network (SFN). The system reliability of an SFN can be computed in terms of all the upper boundary points, called d-MinCuts (d-MCs). Several algorithms have been proposed to find all the d-MCs in an SFN. Here, some recent studies in the liter...
متن کاملBest proximity pair and coincidence point theorems for nonexpansive set-valued maps in Hilbert spaces
This paper is concerned with the best proximity pair problem in Hilbert spaces. Given two subsets $A$ and $B$ of a Hilbert space $H$ and the set-valued maps $F:A o 2^ B$ and $G:A_0 o 2^{A_0}$, where $A_0={xin A: |x-y|=d(A,B)~~~mbox{for some}~~~ yin B}$, best proximity pair theorems provide sufficient conditions that ensure the existence of an $x_0in A$ such that $$d(G(x_0),F(x_0))=d(A,B).$$
متن کاملEfficient Engines for Keyword Proximity Search
This paper presents a formal framework for investigating keyword proximity search. Within this framework, three variants of keyword proximity search are defined. For each variant, there are algorithms for enumerating all the results in an arbitrary order, in the exact order and in an approximate order. The algorithms for enumerating in the exact order make the inevitable assumption that the siz...
متن کامل